On two Hamilton cycle problems in random graphs
نویسندگان
چکیده
We study two problems related to the existence of Hamilton cycles in random graphs. The first question relates to the number of edge disjoint Hamilton cycles that the random graph Gn,p contains. δ(G)/2 is an upper bound and we show that if p ≤ (1 + o(1)) lnn/n then this upper bound is tight whp. The second question relates to how many edges can be adversarially removed from Gn,p without destroying Hamiltonicity. We show that if p ≥ K lnn/n then there exists a constant α > 0 such that whp G−H is Hamiltonian for all choices of H as an n-vertex graph with maximum degree ∆(H) ≤ αK lnn.
منابع مشابه
Closing Gaps in Problems related to Hamilton Cycles in Random Graphs and Hypergraphs
We show how to adjust a very nice coupling argument due to McDiarmid in order to prove/reprove in a novel way results concerning Hamilton cycles in various models of random graphs and hypergraphs. In particular, we firstly show that for k > 3, if pnk−1/ log n tends to infinity, then a random k-uniform hypergraph on n vertices, with edge probability p, with high probability (w.h.p.) contains a l...
متن کاملPacking, Counting and Covering Hamilton cycles in random directed graphs
A Hamilton cycle in a digraph is a cycle passes through all the vertices, where all the arcs are oriented in the same direction. The problem of finding Hamilton cycles in directed graphs is well studied and is known to be hard. One of the main reasons for this, is that there is no general tool for finding Hamilton cycles in directed graphs comparable to the so called Posá ‘rotationextension’ te...
متن کاملA Brief Introduction to Hamilton Cycles in Random Graphs
We survey results concerning Hamilton cycles in random graphs. Specifically, we focus on existence results for general and regular graphs, and discuss algorithms for finding Hamilton cycles and solving related problems (that succeed with high probability).
متن کاملFinding Hamilton cycles in random graphs with few queries
We introduce a new setting of algorithmic problems in random graphs, studying the minimum number of queries one needs to ask about the adjacency between pairs of vertices of G(n, p) in order to typically find a subgraph possessing a given target property. We show that if p ≥ lnn+ln lnn+ω(1) n , then one can find a Hamilton cycle with high probability after exposing (1+o(1))n edges. Our result i...
متن کاملHamilton cycles containing randomly selected edges in random regular graphs
In previous papers the authors showed that almost all d-regular graphs for d ≥ 3 are hamiltonian. In the present paper this result is generalized so that a set of j oriented root edges have been randomly specified for the cycle to contain. The Hamilton cycle must be orientable to agree with all of the orientations on the j root edges. It is shown that the requisite Hamilton cycle almost surely ...
متن کامل